Dependability Engineering of Silent Self-stabilizing Systems
نویسندگان
چکیده
Self-stabilization is an elegant way of realizing non-masking fault-tolerant systems. Sustained research over last decades has produced multiple self-stabilizing algorithms for many problems in distributed computing. In this paper, we present a framework to evaluate multiple selfstabilizing solutions under a fault model that allows intermittent transient faults. To that end, metrics to quantify the dependability of selfstabilizing systems are defined. It is also shown how to derive models that are suitable for probabilistic model checking in order to determine those dependability metrics. A heuristics-based method is presented to analyze counterexamples returned by a probabilistic model checker in case the system under investigation does not exhibit the desired degree of dependability. Based on the analysis, the self-stabilizing algorithm is subsequently refined.
منابع مشابه
On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms
It follows from the definition of silent self-stabilization, and from the definition of proof-labeling scheme, that if there exists a silent self-stabilizing algorithm using `-bit registers for solving a task T , then there exists a proof-labeling scheme for T using registers of at most ` bits. The first result in this paper is the converse to this statement. We show that if there exists a proo...
متن کاملDeterministic silence and self stabilizing leader election algorithm on id based rings
We present in this paper a deterministic silence and self stabilizing leader election algorithm on unidirectional id based rings which have bound on their id values The id values of processors in a ring whose size is N have to be inferior to N k The size of commu nication registers required by the algorithm is constant The algorithm stabilizes in k N time In DGS Dolev Gouda and Schneider have e...
متن کاملPolynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction
Motivated by applications to sensor networks, as well as to many other areas, this paper studies the construction of minimum-degree spanning trees. We consider the classical noderegister state model, with a weakly fair scheduler, and we present a space-optimal silent self-stabilizing construction of minimum-degree spanning trees in this model. Computing a spanning tree with minimum degree is NP...
متن کاملDeveloping Fault-Tolerant Control Systems Composed of Self-Checking Components in the Action Systems Formalism
It is widely recognized that a high degree of dependability of computer-based systems can be achieved if dependability consideration starts from the early stages of system development [10]. In this paper we propose an approach for incorporating means for fault-tolerance in the component-based system development. We discuss architecture of a fault-tolerant system based on a composition of so cal...
متن کاملA Silent Self-stabilizing Algorithm for Finding Cut-nodes and Bridges
In this paper, we present a silent algorithm for finding cut-nodes and bridges in arbitrary rooted networks. This algorithm must be composed with an algorithm from Collin and Dolev. This latter algorithm is also silent and computes a Depth First Search ( ) Spanning Tree of the network. The composition of these two algorithms is self-stabilizing: starting from any arbitrary configuration, it req...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009